Two-Phases Learning Shuffled Frog Leaping Algorithm

نویسندگان

  • Jia Zhao
  • Li Lv
  • Nan Chang
چکیده

In order to overcome the drawbacks of standard shuffled frog leaping algorithm that converges slowly at the last stage and easily falls into local minima, this paper proposed two-phases learning shuffled frog leaping algorithm. The modified algorithm added the elite Gaussian learning strategy in the global information exchange phase, updated frog leaping rule and added the learning capability that the worst frog of current swarm learned from the best frog of other swarm. The learning capability of two-stage on the one hand increased the search range, on the other hand enhanced the diversity of population. Experiments were conducted on 13 classical benchmark functions, the simulation results demonstrated that the proposed approach improved the convergence rate and solution accuracy, when compared with common swarm intelligence algorithm and the latest improved shuffled frog leaping algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Voltage Flicker Parameters Estimation Using Shuffled Frog Leaping Algorithm and Imperialistic Competitive Algorithm

Measurement of magnitude and frequency of the voltage flicker is very important for monitoring andcontrolling voltage flicker efficiently to improve the network power quality. This paper presents twonew methods for measurement of flicker signal parameters using Shuffled Frog Leaping Algorithm(SFLA) and Imperialist Competitive Algorithm (ICA). This paper estimates fundamental voltage andflicker ...

متن کامل

Shuffled Frog-Leaping Programming for Solving Regression Problems

There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...

متن کامل

Optimal Reconfiguration and Capacitor Allocation in Radial Distribution Systems Using the Hybrid Shuffled Frog Leaping Algorithm in the Fuzzy Framework

In distribution systems, in order to diminish power losses and keep voltage profiles within acceptable limits, network reconfiguration and capacitor placement are commonly used. In this paper, the Hybrid Shuffled Frog Leaping Algorithm (HSFLA) is used to optimize balanced and unbalanced radial distribution systems by means of a network reconfiguration and capacitor placement. High accuracy and ...

متن کامل

Combined Heat and Power Economic Dispatch using Improved Shuffled Frog Leaping Algorithm

Recently, Combined Heat and Power (CHP) systems have been utilized increasingly in power systems. With the addition penetration of CHP-based co-generation of electricity and heat, the determination of economic dispatch of power and heat becomes a more complex and challenging issue. The optimal operation of CHP-based systems is inherently a nonlinear and non-convex optimization problem with a lo...

متن کامل

Genetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015